Adaptive Polling Schemes for an ATM Bus with Bursty Arrivals
نویسندگان
چکیده
We consider a high speed ATM bus, which can serve a small number of stations (~ 16). The bus is slotted and each slot is long enough to contain one ATM cell. Transmission on the bus is controlled by an arbitrator. Each station sends its status information to the arbitrator at regular intervals. Based on this information the arbitrator makes polling decisions. Due to transmission and processing times the arbitrator makes decisions based on status information which is a few bus slots old. In this paper, we propose adaptive polling schemes assuming bursty arrivals. The schemes take into account both the cell loss probability and the mean waiting times. The advantage of these new schemes over ordinary polling is also demonstrated.
منابع مشابه
The Upper Bounds for Performance Measures of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper focuses on the upper bounds for both the mean delay and the loss probability that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). We compute the upper bounds f...
متن کاملA Refined Approximation of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper is concerned with both the mean delay and the probability of cell loss that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). A practical polling system with fin...
متن کاملTractable Analysis of a Finite Capacity Polling System under Bursty and Correlated Arrivals
This paper is concerned with the mean delay and the probability of cell loss that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is modeled by a Markov Modulated Bernoulli Process(MMBP) which is able to describe the bursty and correlated nature of th...
متن کاملApproximate Analysis of a Discrete-Time Polling System with Bursty Arrivals
In this paper, we present an approximate analysis of a discrete-time polling system that consists of N input links and a single output link. Each 01 the input links has a flnite buffer to receive incoming traffic. Traffic is assumed to be bursty and is modelled by an Interrupted Bernoulli Process. A shared medium such as a high speed bus is used to forward incoming traffic to the output link in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks and ISDN Systems
دوره 24 شماره
صفحات -
تاریخ انتشار 1992